Tabu Search for the Multi-mode Resource Constarined Project Scheduling Problem Whith Resource Flexibility

The scheduling problem under study may be viewed as an extension of the standard Multi-mode ResourceConstrained Project Scheduling Problem (MRCPSP) including Multi-Skilled Labor and will be called as MRCPSP-MS. This problem requires an integration of resource limitation, labor skills, and multiple possible execution modes for each task, and the objective is to minimize the overall project duration. This paper present a new tabu search (TS) algorithm using a powerful neighborhood function based on a flow graph representation in order to implement various search strategies. The search of the solution space is carried out via two types of moves. Furthermore, the TS algorithm is embedded in a decomposition based heuristic (DBH) which serve to reduce the solution space. The effectiveness of the new Tabu Search is demonstrated through extensive experimentation on different standard benchmark problem instances and proves that our results are competitive.